Printed Copies: Combinational Logic Veriication with Fbdds Combinational Logic Veriication with Fbdds

نویسندگان

  • Christoph Meinel
  • Jordan Gergov
چکیده

Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boolean Manipulation with Free BDDs

Free Binary Decision Diagrams (FBDDs), with respect to a predeened type, provide a canonical representation of Boolean functions, and allow eecient solutions of the basic tasks in Boolean function manipulation similarly as the well{known OBDDs do. But in contrast to OBDDs, typed FBDDs allow more (sometimes exponentially more) succinct representations. In the following, we demonstrate the power ...

متن کامل

Testing Equivalence Probabilistically

Although the equivalence of two Ordered Binary Decision Diagrams (OBDDs) can be decided in polynomial time, the equivalence of two Free Binary Decision Diagrams (FBDDs) is only known to be probabilistically decidable in polynomial time. FBDDs are a strict superset of OBDDs, and are more succinct than OBDDs, which explains the interest in testing their equivalence. We show that the probabilistic...

متن کامل

Speeding up SAT Based ATPG for Logic Veri cation by Recursive Learning

Recursive Learning (RL) is a circuit-structure-based method for computing all necessary assignments. Recursive learning technique can be combined with diierent CAD algorithms and techniques in testing, veriication and optimization. In particular, it is used for Automatic test pattern generation(ATPG) which has been applied to many areas of logic synthesis and formal veriication including combin...

متن کامل

Probabilistic Symbolic Simulation and Veri cation with -OBDDs

Ordered Binary Decision Diagrams (OBDDs) have already proved useful in the veriication of combinational and sequential circuits. Due to limitations of the descriptive power of OBDDs several more general models of Binary Decision Diagrams have been studied. In this paper,-OBDDs-also known as Mod2OBDDs-in respect to their ability to serve as a tool for combinational veriication are considered. Be...

متن کامل

-obdds -a Bdd Structure for Probabilistic Veriication

Ordered Binary Decision Diagrams (OBDDs) have already proved usefull in the veriication of combina-tional and sequential circuits. Due to limitaions of the descriptive power of OBDDs several more general models of Binary Decision Diagrams have been studied. In this paper,-OBDDs-also known as Mod2OBDDs-in respect to their ability to serve as a tool for combinational veriication are considered. B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993